Center Concepts on Distance k-Dominating Sets
نویسندگان
چکیده
منابع مشابه
On non-z(mod k) dominating sets
For a graph G, a positive integer k, k ≥ 2, and a non-negative integer with z < k and z 6= 1, a subset D of the vertex set V (G) is said to be a non-z (mod k) dominating set if D is a dominating set and for all x ∈ V (G), |N [x] ∩ D| 6≡ z (mod k). For the case k = 2 and z = 0, it has been shown that these sets exist for all graphs. The problem for k ≥ 3 is unknown (the existence for even values...
متن کاملA note on dominating sets and average distance
We show that the total domination number of a simple connected graph is greater than the average distance of the graph minus one-half, and that this inequality is best possible. In addition, we show that the domination number of the graph is greater than two-thirds of the average distance minus one-third, and that this inequality is best possible. Although the latter inequality is a corollary t...
متن کاملDominating sets in k-majority tournaments
A k-majority tournament T on a finite vertex set V is defined by a set of 2k − 1 linear orderings of V , with u→ v if and only if u lies above v in at least k of the orders. Motivated in part by the phenomenon of “non-transitive dice”, we let F (k) be the maximum over all k-majority tournaments T of the size of a minimum dominating set of T . We show that F (k) exists for all k > 0, that F (2) ...
متن کاملOn the Number of k-Dominating Independent Sets
We study the existence and the number of k-dominating independent sets in certain graph families. While the case k = 1 namely the case of maximal independent sets which is originated from Erdős and Moser is widely investigated, much less is known in general. In this paper we settle the question for trees and prove that the maximum number of kdominating independent sets in n-vertex graphs is bet...
متن کاملA New Optimality Measure for Distance Dominating Sets
We study the problem of finding the smallest power of an input graph that has k disjoint dominating sets, where the ith power of an input graph G is constructed by adding edges between pairs of vertices in G at distance i or less, and a subset of vertices in a graph G is a dominating set if and only if every vertex in G is adjacent to a vertex in this subset. The problem is a different view of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications Technology and Research
سال: 2017
ISSN: 2319-8656
DOI: 10.7753/ijcatr0602.1007